Asymptotic r-log-convexity and P-recursive sequences

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

POWER TYPE UNIFORM CONVEXITY OF X VIA p - ASYMPTOTIC UNIFORM CONVEXITY OF L r ( X

We show that if Lr(X), 1 < r < ∞, has an asymptotically uniformly convex renorming of power type then X admits a uniformly convex norm of power type.

متن کامل

p-ADIC ASYMPTOTIC PROPERTIES OF CONSTANT-RECURSIVE SEQUENCES

In this article we study p-adic properties of sequences of integers (or p-adic integers) that satisfy a linear recurrence with constant coefficients. For such a sequence, we give an explicit approximate twisted interpolation to Zp. We then use this interpolation for two applications. The first is that certain subsequences of constant-recursive sequences converge p-adically. The second is that t...

متن کامل

Log–convexity of Combinatorial Sequences from Their Convexity

A sequence (xn)n 0 of positive real numbers is log-convex if the inequality xn xn−1xn+1 is valid for all n 1 . We show here how the problem of establishing the log-convexity of a given combinatorial sequence can be reduced to examining the ordinary convexity of related sequences. The new method is then used to prove that the sequence of Motzkin numbers is log-convex.

متن کامل

On the log-convexity of combinatorial sequences

Here presented is a survey for the log-convexity of some famous combinatorial sequences. We develop techniques for dealing with the log-convexity of sequences satisfying a three-term recurrence. We also introduce the concept of q-log-convexity and establish the link with linear transformations preserving the log-convexity. MSC: 05A20; 11B73; 11B83; 11B37

متن کامل

A Criterion for the Log-Convexity of Combinatorial Sequences

Recently, Došlić, and Liu and Wang developed techniques for dealing with the log-convexity of sequences. In this paper, we present a criterion for the log-convexity of some combinatorial sequences. In order to prove the log-convexity of a sequence satisfying a three-term recurrence, by our method, it suffices to compute a constant number of terms at the beginning of the sequence. For example, i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Symbolic Computation

سال: 2019

ISSN: 0747-7171

DOI: 10.1016/j.jsc.2018.04.012